Fast computation of von Neumann entropy for large-scale graphs via quadratic approximations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractal Von Neumann Entropy

We consider the fractal von Neumann entropy associated with the fractal distribution function and we obtain for some universal classes h of fractons their entropies. We obtain also for each of these classes a fractal-deformed Heisenberg algebra. This one takes into account the braid group structure of these objects which live in two-dimensional multiply connected space. PACS numbers: 05.30.-d; ...

متن کامل

A Quantum von Neumann Architecture for Large-Scale Quantum Computing

As the size of quantum systems becomes bigger, more complicated hardware is required to control these systems. In order to reduce the complexity, I discuss the amount of parallelism required for a fault-tolerant quantum computer and what computation speed can be achieved in different architectures. To build a large-scale quantum computer, one can use architectural principles, from classical com...

متن کامل

Von Neumann entropy and majorization

We consider the properties of the Shannon entropy for two probability distributions which stand in the relationship of majorization. Then we give a generalization of a theorem due to Uhlmann, extending it to infinite dimensional Hilbert spaces. Finally we show that for any quantum channel Φ, one has S(Φ(ρ)) = S(ρ) for all quantum states ρ if and only if there exists an isometric operator V such...

متن کامل

Perturbation theory of von Neumann Entropy

In quantum information theory, von Neumann entropy plays an important role. The entropies can be obtained analytically only for a few states. In continuous variable system, even evaluating entropy numerically is not an easy task since the dimension is infinite. We develop the perturbation theory systematically for calculating von Neumann entropy of non-degenerate systems as well as degenerate s...

متن کامل

The von Neumann entropy of networks

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study its von Neumann entropy. At the graph-theoretic level, this quantity may be interpreted as a measure of regularity; it tends to be larger in relation to the nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2020

ISSN: 0024-3795

DOI: 10.1016/j.laa.2019.09.031